Synthesis modulo recursive functions
نویسندگان
چکیده
منابع مشابه
Satisfiability Modulo Recursive Programs
We present a semi-decision procedure for checking satisfiability of expressive correctness properties of recursive first-order functional programs. In our approach, both properties and programs are expressed in the same language, a subset of Scala. We implemented our procedure and integrated it with the Z3 SMT solver and the Scala compiler. Our procedure is sound for counterexamples and for pro...
متن کاملSynthesis of Recursive Functions with Interdependent Parameters
We present a methodology for the inductive synthesis of recursive functions based on the theoretical framework of context-free tree grammars. The synthesis task is splitted into two parts: First, a small set of positive input/output examples is transformed into an “initial program” by means of heuristic search; second, the initial program is generalized to a recursive function. In this paper we...
متن کاملSubtyping Recursive Types Modulo Associative Commutative Products
We study subtyping of recursive types in the presence of associative and commutative products—that is, subtyping modulo a restricted form of type isomorphisms. We show that this relation, which we claim is useful in practice, is a composition of the usual subtyping relation with the recently proposed notion of equality up to associativity and commutativity of products, and we propose an efficie...
متن کاملOn the Synthesis of Strategies Identifying Recursive Functions
A classical learning problem in Inductive Inference consists of identifying each function of a given class of recursive functions from a finite number of its output values. Uniform learning is concerned with the design of single programs solving infinitely many classical learning problems. For that purpose the program reads a description of an identification problem and is supposed to construct...
متن کاملProactive Synthesis of Recursive Tree-to-String Functions from Examples
Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute to foundations of such techniques and present a complete algorithm for synthesis of a class of recursive functions defined by structural recur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2013
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2544173.2509555